Bicriteria Network Design via Iterative Rounding
نویسنده
چکیده
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for this problem, by extending a linear programming based technique of iterative rounding. Previously, a (4, 4)-approximation algorithm for this problem was known. The running time of this previous algorithm is not strongly polynomial.
منابع مشابه
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network design problem. We show as an structural result that in each iteration of our algorithm there is an LP variable in a basic feasible solution which is at least one-third-integral resulting a 3-approximation algorithm for...
متن کاملSurvivable Network Design with Degree or Order
We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...
متن کاملOn Generalizations of Network Design Problems with Degree Bounds
The problem of designing efficient networks with degree-bound constraints has received a lot of attention recently. In this paper, we study several generalizations of this fundamental problem. Our generalizations are of the following two types: – Generalize constraints on vertex-degree to arbitrary subsets of edges. – Generalize the underlying network design problem to other combinatorial optim...
متن کاملEnergy-Efficient Network Routing with Discrete Cost Functions
Energy consumption is an important issue in the design and use of networks. In this paper, we explore energy savings in networks via a rate adaptation model. This model can be represented by a costminimization network routing problem with discrete cost functions. We formulate this problem as an integer program, which is proved to be NP-hard. Then a constant approximation algorithm is developed....
متن کاملA bad example for the iterative rounding method for mincost k-connected spanning subgraphs
Jain’s iterative rounding method and its variants give the best approximation guarantees known for many problems in the area of network design. The method has been applied to the mincost k-connected spanning subgraph problem, but the approximation guarantees given by the method are weak. We construct a family of examples such that the standard LP relaxation has an extreme point solution with in...
متن کامل